(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
a(b(x)) → a(c(b(x)))
Rewrite Strategy: INNERMOST
(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)
Converted CpxTRS to CDT
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(b(z0)) → a(c(b(z0)))
Tuples:
A(b(z0)) → c1(A(c(b(z0))))
S tuples:
A(b(z0)) → c1(A(c(b(z0))))
K tuples:none
Defined Rule Symbols:
a
Defined Pair Symbols:
A
Compound Symbols:
c1
(3) CdtGraphRemoveDanglingProof (ComplexityIfPolyImplication transformation)
Removed 1 of 1 dangling nodes:
A(b(z0)) → c1(A(c(b(z0))))
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(b(z0)) → a(c(b(z0)))
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
a
Defined Pair Symbols:none
Compound Symbols:none
(5) SIsEmptyProof (EQUIVALENT transformation)
The set S is empty
(6) BOUNDS(O(1), O(1))